Subject: Re: simulation of Q-OSPF

From: Mark Pullen <[email-masked]>
Date: Fri, 25 Jul 1997 09:46:14 -0400 (EDT)

Ken,

At present, we do not include a factor for the compute time
to calculate the routing, etc.  But we actually DO the routing
calculations, and have time them.  They are typically under 50ms
on a Sparc20 for our  test network (almost 100 nodes).  As the model 
gets more sophisticated we should add a factor for this directly
to eth simulation.  Unfortunately we have been on hold with
regard to model improvements recently as we are waiting for
a license renewal to OPNET.  Should get back on the project next 
month.

The calculation is the Dykstra algorithm specified by OSPF/MOSPF/QOSPF.

I will cc this to the qosr list because it is a question of general 
interest.

Mark

> From [email-masked] Fri Jul 25 04:53 EDT 1997
> To: [email-masked]
> Subject: simulation of Q-OSPF
> Mime-Version: 1.0
> Date: Fri, 25 Jul 1997 09:49:31 +0100
> From: Kenneth CARLBERG <[email-masked]>
> 
> Hi Mark,
> 
> I was wondering if your simulation work will take into account
> the computational time for calculating different metrics associated
> with a given destination?  Also, will you be using a straight 
> Dyjkstra for the calculation, or are there other optimization
> of the calculation that you are considering?
> 
> regards,
> 
> -ken
> 
> 
> 
>

---

From: Yao-Min Chen <[email-masked]>
Date: Fri, 25 Jul 1997 10:10:45 -0700

Mark, 

I am reading this thread with great interest.  I'd like to know
the purpose of your simulation, since it was not very clear 
from you and Ken's messages.  Pointers are deeply appreciated. 

Yao-Min 

-- 
=====================================================================
Yao-Min Chen				
Member of Research Staff                phone: +1-408-567-4513
Fujitsu Laboratories of America         fax: +1-408-567-4558
3350 Scott Blvd., Bldg. 34              [email-masked]
Santa Clara, CA 95054		
======================================================================